Graph annotations in modeling complex network topologies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling context with graph annotations

Organisational policies are often formed of declarational (defining constraints on functional services) and operational (realising functionalities via simple activities) aspects. However, when several perspectives are involved, constraints and operations can comprise different aspects, without identifying the origin of some details. We propose the use of annotations as a way to flexibly add and...

متن کامل

Efficient graph topologies in network routing games

A topology is efficient for network games if, for any game over it, every Nash equilibrium is socially optimal. It is well known that many topologies are not efficient for network games. We characterize efficient topologies in network games with a finite set of players, each wishing to transmit an atomic unit of unsplittable flow. We distinguish between two classes of atomic network routing gam...

متن کامل

Random graph models of communication network topologies

We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes limiting to infinity has been considered. It was found that an interesting structure appears. It has resemblance with such graphs like the Internet graph. Som...

متن کامل

Modeling Social Network Topologies in Elementary Schools

Complex networks are used to describe interactions in many real world systems, including economic, biological and social systems. An analysis was done of inter-student friendship, enmity and kinship relationships at three elementary schools by building social networks of these relationships and studying their properties. Friendship network measurements were similar between schools and produced ...

متن کامل

Consistently weighted measures for complex network topologies

When network and graph theory are used in the study of complex systems, a typically finite set of nodes of the network under consideration is frequently either explicitly or implicitly considered representative of a much larger finite or infinite set of objects of interest. The selection procedure, e. g., formation of a subset or some kind of discretization or aggregation, typically results in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation

سال: 2009

ISSN: 1049-3301,1558-1195

DOI: 10.1145/1596519.1596522